| 1. | Balancing two - sided assembly line based on branch and bound way
多品种混合型装配流水线的平衡设计 |
| 2. | A new branch and bound algorithm for solving complex integer quadratic programs
解复杂二次整数规划问题的新型分枝定界算法 |
| 3. | Branch and bound algorithm
分枝界定法 |
| 4. | A branch and bound algorithm for solving maximizing a concave function over weakly - efficient
弱有效集上凹函数极大问题的分枝定界算法 |
| 5. | Branch and bound algorithm is an important method to be used to acquire the solution of optimal problems
分支定界算法是求解优化问题的重要方法。 |
| 6. | 4 . the tsp as benchmark shows that this cluster platform can increase the branch and bound algorithm ’ s efficiency and get the optimal solution soon
计算表明,在保证求得最优解的前提下,该平台能很好地提高分支定界算法的效率。 |
| 7. | When problem scale is small , we can adopt many classical algorithms such as linear programming integer programming , branch and bound method to solve this problem
当问题规模较小时，可用线性规划、整数规划、动态规划等经典算法求解。 |
| 8. | This paper consists of two parts . in the first part , a new branch and bound algorithm for minimizing the nonconvex quadratic programming with box constraints is proposed
本文分两部分，第一部分研究求解边界约束非凸二次规划问题的整体最优解的分支定界算法。 |
| 9. | The solving tsp ( traveling salesman problem ) examples as benchmark shows that this platform can increase the branch and bound algorithm ' s efficiency and get the optimal solution sooner
计算表明，在保证求得最优解的前提下，该平台能很好地提高分支定界算法的效率。 |
| 10. | To improve the efficiency of the branch and bound technique , some heuristic principles are proposed to cut those branches that may generate global optimization solution with low probability
同时，为提高分支定界法的效率，利用启发式规则剪去产生最优解可能性很小的分支。 |
